Adherences of languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Topological Structure of Adherences of Regular Languages

— The topological structure of the adhérence of a regular language is characterized by afînite invariant structure that can be algorithmically constructed from any automaton recognizing the language. Homeomorphism of the adhérences of regular languages can be decided by constructing and comparing their associated invariant structures. These results are obtained by applying concepts and analyses...

متن کامل

On minimal realization of IF-languages: A categorical approach

he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1980

ISSN: 0022-0000

DOI: 10.1016/0022-0000(80)90010-0